package com.example.demo.math;

public class Demo2 {


    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m+1][n+1];   // dp[i][j]表示网格为 i 和 j的方案数
        for (int i = 0;i<m ;i++){dp[i][0] =1;}
        for (int i = 0;i<n ;i++){dp[0][i] =1;}
        for( int i = 1 ;i<m;i++){
            for (int j =1;j<n;j++){
                dp[i][j] = dp[i-1][j]+dp[i][j-1];
            }
        }
        return dp[m-1][n-1];
    }
}
class Test2{

    public static void main(String[] args) {
        Demo2 d = new Demo2();
        System.out.println(d.uniquePaths(7, 3));
    }
}